Fast RNC and NC Algorithms for Maximal Path Sets
نویسندگان
چکیده
منابع مشابه
Extending NC and RNC Algorithms
A technique is presented by which NC and RNC algorithms for some problems can be extended into NC and RNC algorithms, respectively, that solve more general parametric problems. The technique is demonstrated on explicit bounded degree circuits. Applications include parametric extensions of the shortest-path and spanning-tree problems and, in particular, the minimum-ratio-cycle problem, showing a...
متن کاملAn Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملPram Models and Fundamental Parallel Algorithmic Techniques: Part Ii (randomized Algorithms)
There are many elds of algorithms design where probabilistic methods and random-ization lead to appreciable gains. In fact, randomness has emerged as a fundamental tool in the design and analysis of algorithms. It is substantially easier to obtain algorithms for many problems if we allow the use of randomness as a resource. This has been demonstrated for parallel algorithms as well. In this cha...
متن کاملOn Computing a Maximal Independent Set in Hypergraph in Parallel
An outstanding open question in the theory of parallel computation is whether a maximal independent set (MIS) in a given hypergraph, can be computed in NC or RNC. One major bottleneck seems to be controlling the dimension of the hypergraph, i.e. the maximum dimension of a hyperedge. In the case of graphs (dimension 2 hypergraphs), Karp and Wigderson’85 gave the first NC algorithm. In the case o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 215 شماره
صفحات -
تاریخ انتشار 1999